Verifying the DPLL Algorithm in Dafny
نویسندگان
چکیده
منابع مشابه
Dafny: Statically Verifying Functional Correctness
This report presents the Dafny language and verifier, with a focus on describing the main features of the language, including preand postconditions, assertions, loop invariants, termination metrics, quantifiers, predicates and frames. Examples of Dafny code are provided to illustrate the use of each feature, and an overview of how Dafny translates programming code into a mathematical proof of f...
متن کاملDafny Verification of kNN Algorithm
A data set in machine learning is simply a table representing collections of entries. Each entry, has attributes of which can be thought as the columns in a table. A label describes the class or category of an entry. For binary labels each entry may posses a class label of 0 or 1 of which can be thought of as negative or positive labels. Model and classifier are used synonymously. Two phases ar...
متن کاملExtracting a DPLL Algorithm
We formalize a completeness proof for the DPLL proof system and extract a DPLL SAT solver from it. When applied to a propositional formula in conjunctive normal form the program produces either a satisfying assignment or a DPLL derivation which shows that it is unsatisfiable. We use non-computational quantifiers to remove redundant computational content from the extracted program and improve it...
متن کاملA DPLL Algorithm with Literal Renaming Strategy
Restricted on the proof of unsatisfiability of unsatisfiable formulas, a modified DPLL — RSMLS algorithm is presented. The new algorithm has a symmetry rule (Literal renaming ) and three simplified rule ((1,*)-Resolution, Subformula, and Multiple ). As an example, RSMLS algorithm is applied for the proof of unsatisfiability of pigeon-hole formula . We show with respect to RSMLS algorithm that h...
متن کاملA DPLL Algorithm for Solving DQBF
Dependency Quantified Boolean Formulas (DQBF) comprise the set of propositional formulas which can be formulated by adding Henkin quantifiers to Boolean logic. We are not aware of any published attempt in solving this class of formulas in practice. However with DQBF being NEXPTIME-complete, efficient ways of solving it would have many practical applications. In this paper we describe a DPLL-sty...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2019
ISSN: 2075-2180
DOI: 10.4204/eptcs.303.1